Resolution Method in Linguistic Propositional Logic
نویسندگان
چکیده
In the present paper, the resolution method for a linguistic propositional logic with truth value in a logical algebra refined hedge algebra, is focused. The preliminaries of refined hedge algebra are given first. Then the syntax and semantic of linguistic propositional are defined. Finally, a resolution method which based on resolution principle in two-valued logic is established. Accordingly, the research in this paper will be helpful support for the application of intelligent reasoning system based on linguistic-valued logic which includes incomparable information. Keywords—Resolution; Linguistic Truth Value; Linguistic Propositional Logic; Hedge Algebra. .
منابع مشابه
Determination of α -Resolution for Lattice-Valued First-Order Logic Based on Lattice Implication Algebra
As a continuation of our research work on resolutionbased automated reasoning approaches for latticevalued logic systems with truth-values in a latticevalued logical algebraic structure – lattice implication algebra (LIA), in the present paper, we prove thatα resolution for lattice-valued first-order logic ( ) LF X based on LIA can be equivalently transformed into that for lattice-valued propos...
متن کاملResolution in Linguistic Propositional Logic Based on Linear Symmetrical Hedge Algebra
The paper introduces a propositional linguistic logic that serves as the basis for automated uncertain reasoning with linguistic information. First, we build a linguistic logic system with truth value domain based on a linear symmetrical hedge algebra. Then, we consider Gödel’s t-norm and t-conorm to define the logical connectives for our logic. Next, we present a resolution inference rule, in ...
متن کاملEquality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملPropositional Temporal Proving with Reductions to a SAT Problem
We present a new approach to reasoning in propositional linear-time temporal logic (PLTL). The method is based on the simplified temporal resolution calculus. We prove that the search for premises to apply the rules of simplified temporal resolution can be re-formulated as a search for minimal unsatisfiable subsets (MUS) in a set of classical propositional clauses. This reformulation reduces a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016